Linear Logic as Logic Programming: An Abstract

The theory of cut-free sequent proofs has been used to motivate and justify the design of a number of logic programming languages. Two such languages, Prolog and its linear logic re nement, Lolli [13], provide for various forms of abstraction (modules, abstract data types, and higher-order programming) but lack primitives for concurrency. The logic programming language, LO (Linear Objects) [2] provides some primitives for concurrency but lacks abstraction mechanisms. Forum is a logic programming presentation of all of linear logic that modularly extends Prolog, Lolli, and LO. This language, therefore, allows speci cations to incorporate both abstractions and concurrency.